An Abstract Algebraic Logic View on Judgment Aggregation

نویسندگان

  • María Esteban
  • Alessandra Palmigiano
  • Zhiguang Zhao
چکیده

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg’s algebraic approach to characterization results in on judgment aggregation and propositionalattitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, respectively. The characterization result of the present paper applies to agendas of formulas of an arbitrary selfextensional logic. This notion comes from AAL, and encompasses a vast class of logics, of which classical, intuitionistic, modal, many-valued and relevance logics are special cases. To each selfextensional logic S , a unique class of algebras AlgS is canonically associated by the general theory of AAL. We show that for any selfextensional logic S such that AlgS is closed under direct products, any algebra in AlgS can be taken as the set of truth values on which an aggregation problem can be formulated. In this way, judgment aggregation on agendas formalized in classical, intuitionistic, modal, many-valued and relevance logic can be uniformly captured as special cases. This paves the way to the systematic study of a wide array of “realistic agendas” made up of complex formulas, the propositional connectives of which are interpreted in ways which depart from their classical interpretation. This is particularly interesting given that, as observed by Dietrich [4], nonclassical (subjunctive) interpretation of logical connectives can provide a strategy for escaping impossibility results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Logic view on Judgment Aggregation ?

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg’s algebraic approach to characterization results on judgment aggregation and propositionalattitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, respec...

متن کامل

Systematic judgment aggregators: An algebraic connection between social and logical structure

We present several results that show that systematic (complete) judgment aggregators can be viewed as both (2-valued) Boolean homomorphisms and as syntatic versions of reduced (ultra)products. Thereby, Arrovian judgment aggregators link the Boolean algebraic structures of (i) the set of coalitions (ii) the agenda, and (iii) the set of truth values of collective judgments. Since filters arise na...

متن کامل

Logics for Collective Reasoning

In this paper, we discuss the approach based on Social Choice Theory and Judgment Aggregation to the definition of collective reasoning. We shall make explicit the aggregative nature of the notion of collective reasoning that is defined in the Judgment Aggregation account and we shall stress that the notion of logical coherence plays a fundamental role in defining collective attitudes. Unfortun...

متن کامل

Judgment Aggregation in Dynamic Logic of Propositional Assignments

Judgment Aggregation studies how agents take a collective decision on a certain number of issues based on their individual opinions. In recent years, a line of research in Judgment Aggregation investigates how to model this framework within a logical calculus — usually designed ad hoc for this purpose. By contrast, in this thesis we show how it is possible to translate any aggregation problem f...

متن کامل

Towards Algebraic Separation Logic

We present an algebraic approach to separation logic. In particular, we give algebraic characterisations for all constructs of separation logic like assertions and commands. The algebraic view does not only yield new insights on separation logic but also shortens proofs and enables the use of automated theorem provers for verifying properties at a more abstract level.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015